A trust region algorithm for parametric curve and surface fitting
نویسندگان
چکیده
منابع مشابه
A trust region algorithm for parametric curve and surface fitting
Let a family of curves or surfaces be given in parametric form via the model equation x =J‘(s, /I), where x E R”, p E KY’, and s E S c [wd. d < n. We present an algorithm for solving the problem: Find a shape cec’tor p* such that the manlfold M* = (f(s, /I*): s E S) is a best fir to scattered data :z, j ,‘= , c R” in the Sense that, jbr some is* )y=, , the sum of the squared least distances )-y...
متن کاملA Trust Region Algorithm for Solving Nonlinear Equations (RESEARCH NOTE)
This paper presents a practical and efficient method to solve large-scale nonlinear equations. The global convergence of this new trust region algorithm is verified. The algorithm is then used to solve the nonlinear equations arising in an Expanded Lagrangian Function (ELF). Numerical results for the implementation of some large-scale problems indicate that the algorithm is efficient for these ...
متن کاملAn improved algorithm for algebraic curve and surface fitting
Recent years have seen an increasing interest in algebraic curves and surfaces of high degree as geometric models or shape descriptors for model-based computer vision tasks such as object recognition and position estimation. Although their invariant-theoretic properties them a natural choice for these tasks, fitting algebraic curves and surfaces to data sets is difficult, and fitting algorithms...
متن کاملA Curve Fitting Algorithm for Character Fonts
This paper presents an algorithm that automatically generates outline fonts from a grey-level image of a character obtained by a scanner. Our algorithm begins by extracting contour points from the image and dividing the points into a number of segments at the corner points. The next step is fitting a piecewise cubic Bézier curve to each segment. To fit cubic Bézier curves to segments, we use le...
متن کاملPiecewise Cubic Curve Fitting Algorithm
We give a piecewise cubic curve fitting algorithm which preserves monotonicity of the data. The algorithm has a higher order of convergence than the Fritsch-Carlson algorithm and is simpler than the Eisenstat-Jackson-Lewis algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1996
ISSN: 0377-0427
DOI: 10.1016/0377-0427(96)00039-8